Graph connectivity - PDFSEARCH.IO - Document Search Engine

Graph connectivity
Results: 1040

#	Item
911	Local resilience of graphs arXiv:0706.4104v2 [math.CO] 1 Dec 2007 Benny Sudakov Add to Reading List Source URL: arxiv.org Language: English - Date: 2008-02-04 22:30:50 Extremal graph theory Random graphs Connectivity Matching NP-complete problems Graph Neighbourhood Clique Line graph Graph theory Mathematics Graph coloring
912	Homology Flows, Cohomology Cuts∗ Erin W. Chambers† Jeff Erickson‡ Amir Nayyeri§ Add to Reading List Source URL: compgeom.cs.uiuc.edu Language: English - Date: 2012-01-21 00:53:08 Planar graph Maximum flow problem Shortest path problem Minor Graph coloring Neighbourhood Homeomorphism Tree decomposition Connectivity Graph theory Mathematics Graph operations
913	Hands-On Lab Code Discovery using the Architecture Tools in Visual Studio Ultimate 2013 Add to Reading List Source URL: download.microsoft.com Language: English - Date: 2013-12-18 20:14:30 DGML Graph drawing Graph coloring Graph theory Mathematics Connectivity
914	Undirected Graphs and Networks Networks and graphs A network is a collection of objects connected to each other in some specific way. A graph is a finite set of dots called vertices (or nodes) connected by links called e Add to Reading List Source URL: www.di-mgt.com.au Language: English - Date: 2003-09-21 13:50:00 Graph connectivity Graph coloring Hamiltonian path Eulerian path Path Graph Spanning tree Tree Route inspection problem Graph theory Theoretical computer science NP-complete problems
915	Counting and Sampling Minimum Cuts in Genus g Graphs Erin W. Chambers∗ Kyle Fox† Amir Nayyeri‡ Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2013-09-03 13:18:47 Maximum flow problem Network flow Tree Matching Minimum spanning tree Minimum cut Graph Connectivity Directed acyclic graph Graph theory Mathematics Combinatorial optimization
916	Better Guarantees for Sparsest Cut Clustering Maria-Florina Balcan Microsoft Research, New England One Memorial Drive, Cambridge, MA [removed] Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-05-22 14:29:08 Computational statistics Cut Graph connectivity K-means clustering K-medians clustering Approximation algorithm Linear programming relaxation K-means++ Cluster analysis Statistics Mathematics Combinatorial optimization
917	How to transform a List Coloring problem into a Traveling Salesman one DRAFT[removed]removed] Abstract This paper describes a method to transform a List Coloring Problem (LCP) into a Traveling Add to Reading List Source URL: clerc.maurice.free.fr Language: English - Date: 2012-11-29 03:08:56 NP-complete problems Travelling salesman problem Graph coloring Hamiltonian path Connectivity Edge coloring Bellman–Ford algorithm Graph theory Theoretical computer science Mathematics
918	What Cannot Be Computed Locally!∗ Fabian Kuhn Thomas Moscibroda Roger Wattenhofer Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2004-05-29 12:05:51 Graph theory NP-complete problems Spanning tree Connectivity Graph coloring R-tree B-tree Degree Tree Theoretical computer science Mathematics Computational complexity theory
919	Optimal Gradient Clock Synchronization in Dynamic Networks Fabian Kuhn Christoph Lenzen Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2010-07-29 05:34:11 Theoretical computer science Synchronization Network theory Clock signal Clock skew Flow network Connectivity Shortest path problem Clock synchronization Graph theory Mathematics Network flow
920	Optimal Gradient Clock Synchronization in Dynamic Networks (Technical Report) Fabian Kuhn1 Christoph Lenzen2 Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2010-08-16 10:36:31 Network flow Synchronization Flow network Operations research Clock skew Connectivity Clock synchronization Shortest path problem Ford–Fulkerson algorithm Graph theory Mathematics Theoretical computer science

UPDATE